Generalized Source Coding Theorems and HypothesisTesting : Part I { Information
نویسندگان
چکیده
Expressions for "-entropy rate, "-mutual information rate and "-divergence rate are introduced. These quantities, which consist of the quantiles of the asymptotic information spectra, generalize the inf/sup-entropy/information/divergence rates of Han and Verd u. The algebraic properties of these information measures are rigorously analyzed, and examples illustrating their use in the computation of the "-capacity are presented. In Part II of this work, these measures are employed to prove general source coding theorems for block codes and the general formula of the Neyman-Pearson hypothesis testing type-II error exponent subject to upper bounds on the type-I error probability.
منابع مشابه
Generalized Source Coding Theorems and Hypothesis Testing: Part Ii { Operational Limits
In light of the information measures introduced in Part I, a generalized version of the Asymp-totic Equipartition Property (AEP) is proved. General xed-length data compaction and data compression (source coding) theorems for arbitrary nite-alphabet sources are also established. Finally, the general expression of the Neyman-Pearson type-II error exponent subject to upper bounds on the type-I err...
متن کاملRelative entropies and their use in quantum information theory
This dissertation investigates relative entropies, also called generalized divergences, and how they can be used to characterize information-theoretic tasks in quantum information theory. The main goal is to further refine characterizations of the optimal rates for quantum source coding, state redistribution, and measurement compression with quantum side information via second order asymptotic ...
متن کاملCoding Theorems on Generalized Cost Measure
In the present communication a generalized cost measure of utilities and lengths of output codewords from a memoryless source are defined. Lower and upper bounds in terms of a non-additive generalized measure of ‘useful’ information are obtained.
متن کاملSecond-order noiseless source coding theorems
I. Kontoyiannis Appeared in IEEE Trans. Inform. Theory, 43, pp. 1339 1341, July 1997. Abstract { Shannon's celebrated source coding theorem can be viewed as a \one-sided law of large numbers." We formulate second-order noiseless source coding theorems for the deviation of the codeword lengths from the entropy. For a class of sources that includes Markov chains we prove a \one-sided central limi...
متن کاملDistortion-rate bounds for fixed- and variable-rate multiresolution source codes
The source coding theorem for stationary sources describes the optimal performance theoretically achievable by fixedand variable-rate block quantizers. The source coding theorem may be generalized by considering the problem of multiresolution or successive refinement source coding, which is the topic of this work. Given a distortion vector (D1; ; DL), this work describes the family of achievabl...
متن کامل